#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>

using namespace std;

long long a[25], sum, maxv;


int main()
{
	double t;
	int n, i;
	bool yes;
	
//	freopen("iin.txt", "r", stdin);
//	freopen("iout.txt", "w", stdout);
	
	while (1)
	{
		cin >> n;
		if (!n) break;
		
		memset(a, 0, sizeof(a));
		
		
		for (i=1; i<=n; ++i)
		{
			cin >> t;
			a[i] = (long long)(t*1000+0.5);
		}
		
//		for (i=1; i<=n; ++i)
//			printf("%d ", a[i]);
		
		if (n==1) 
		{
			printf("NO\n");
			continue;
		}
		if (n==2)
		{
			if (a[1]!=a[2]) printf("NO\n");
			else printf("YES\n");
			continue;
		}
		
		sort(a+1,a+n+1);
		yes = false;
		sum = a[1] + a[2];
		for (i=3; i<=n; ++i)
		{
			if (sum >= a[i])
			{
				yes = true;
				break;
			}
			sum += a[i];
		}
		
		if (!yes)
		{
			for (i=1; i<n; ++i)
				if (a[i] == a[i+1])
					{
						yes = true;
						break;
					}
		}

		if (yes) printf("YES\n");
		else printf("NO\n");
			
		
		
		
		
	
	}
	return 0;
}

